A hybrid algorithm for flexible job-shop scheduling problem with setup times
نویسندگان
چکیده
منابع مشابه
A hybrid algorithm for flexible job-shop scheduling problem with setup times
Job-shop scheduling problem is one of the most important fields in manufacturing optimization where a set of n jobs must be processed on a set of m specified machines. Each job consists of a specific set of operations, which have to be processed according to a given order. The Flexible Job Shop problem (FJSP) is a generalization of the above-mentioned problem, where each operation can be proces...
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...
متن کاملA New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times
In this paper we face the Job Shop Scheduling Problem with Sequence Dependent Setup Times by means of a genetic algorithm hybridized with local search. We have built on a previous work and propose a new neighborhood structure for this problem which is based on reversing operations on a critical path. We have conducted an experimental study across the conventional benchmarks and some new ones of...
متن کاملThe Job-shop Scheduling Problem the Job-shop Scheduling Problem with Setup Times
This paper reports a bibliographical study and some personnal works about the general Jobshop Problem and Jobshop Problems with setup times. Section 1 introduces some { usual { notations about the general problem. Speciic notations concerning with setup times will be introduced later. The bibliograacal study, in Section 2 focuses on recent papers on both problems. Section 3 presents a general s...
متن کاملA New Multi-objective Job Shop Scheduling with Setup Times Using a Hybrid Genetic Algorithm
This paper presents a new multi-objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. Scince a job shop scheduling problem has been proved to be NP-hard in a strong, traditional approaches cannot reach to an optimal solution in a reasonable time. Thus, we propose an efficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Management and Engineering
سال: 2017
ISSN: 2340-4876
DOI: 10.4995/ijpme.2017.6618